Blind detection

ABSTRACT

The present invention relates to a blind detection of a received signal having at least one property, which initially is unknown to the receiver, however, limited to a finite set of alternatives ({p 1 , p 2 , . . . , p m }). According to the invention, the unknown property is automatically identified as follows. A respective quality measure (q 1 , q 2 , . . . , q m ) is derived from the incoming signal (r(n)), which each represents a particular property in the finite set of alternatives ({p 1 , p 2 , . . . , p m }). The quality measures (q 1 , q 2 , . . . , q m ) are obtained according to a procedure that involves a computationally efficient rejection of any unwanted signal components in the incoming signal (r(n)). Then, the quality measures (q 1 , q 2 , . . . , q m ) are compared with each other in order to find a quality measure, which best fulfils a blind selection criterion. The quality measure (q i ) thus obtained corresponds to the initially unknown property (p i ). For instance, based on this information, the incoming signal (r(n)) may then be further processed in a processing unit ( 122 ), which operates according to a processing principle (C di ) that is adapted to this property (p i ).

THE BACKGROUND OF THE INVENTION AND PRIOR ART

[0001] The present invention relates generally to blind detection of received signals having at least one property, which initially is unknown to the receiver. More particularly the invention relates to a method of identifying a property from a finite set of alternatives of an incoming signal according to the preamble of claim 1 and a blind signal detector according to the preamble of claim 21. The invention also relates to a computer program according to claim 19 and a computer readable medium according to claim 20.

[0002] Many communication standards provide examples of situations where a receiver must be able to receive a certain signal whose format, at least to some extent, is unknown. The receiver thus needs to perform a blind detection of the signal, i.e. no signaling takes place between the transmitter and the receiver before transmission according to the unknown format is initiated.

[0003] The GSM/EDGE-standard (GSM=Global System for Mobile communication; EDGE=Enhanced Data rates for Global Evolution) utilizes two different modulation schemes, namely GMSK (Gaussian Minimum Shift Keying) and 8PSK (Phase Shift Keying with eight different phase states). At start of transmission the transmitter may use any of these modulation schemes. Furthermore, during transmission, the modulation schemes can be changed, without notice, between every radio block (i.e. between every set of four consecutive bursts). This transmitter behavior, of course, requires a blind-detection capability of the receiver, at least with respect to said modulation schemes.

[0004] A theoretically conceivable solution would be to detect any received burst in parallel, both by means of a GMSK-equalizer and by means of an 8PSK-equalizer. This would result in two estimated sequences of bits that correspond to the received signal. A checksum/parity test could then be used to determine which modulation scheme that was actually applied when transmitting the sequence. The sequence detected under the incorrect modulation format would namely not pass such test. Naturally, the payload information contained in the received burst can also be derived through this solution simply by studying the sequence corresponding to the correct modulation format. However, the solution is far too computationally complex to be implemented in real time applications and is therefore not interesting from a technical point-of-view. There is yet no alternative solution either, which is satisfying in this respect.

[0005] The standard document ETSI Tdoc SMG2 EDGE 2E99-279, ETSI SMG2 Working Session on EDGE, Montigny Le Bretonneux, France, 24-27 Aug., 1999 presents a method for automatic detection of another unknown property of a received signal, namely a training sequence, and how to select an appropriate detection principle for the received signal. The document proposes that one out of three possible training sequences be identified according to the following procedure. First, a signal in the form of a radio burst is received. This signal is tested against a respective hypothesis for each of the three possible training sequences. The training sequence that corresponds to the hypothesis that results in the highest estimated signal power of the received burst is then selected as the training sequence having been used for the burst in question. Under ideal conditions, this procedure generally generates selection decisions of a sufficient accuracy. However, an actual radio environment is usually far from ideal. The received signal is hence more or less distorted by additive noise and/or interference signals. The interference signals typically originate from other radio stations, either transmitting at the same frequency/channel (so-called co-channel interference) or transmitting at an adjacent frequency/channel (so-called adjacent channel interference).

[0006] The demodulation schemes of today's radio communication systems normally include interference rejection algorithms in order to mitigate the effects of any undesired signal components in the received signal, such as noise and interference signals. In case a receiver in a system of this kind is required to make decisions pertaining to an unknown property of a received signal, and if these decisions per se do not involve interference rejection, there is a risk that the interference rejection algorithms with respect to the detected signal become useless, namely if, due to interference, an incorrect blind detection decision is taken. Hence, if a corresponding interference rejection is not also included in the blind detection procedure, this procedure is prone to be the limiting factor for the receiver performance, and consequently the entire system's performance. Presently, there exists no blind detection procedure, which involves interference rejection. Moreover, a direct inclusion of any of the known interference rejection algorithms into the known blind detection procedures would, again, impose a computation demand on the receiver, which is too high to be performed in real time.

SUMMARY OF THE INVENTION

[0007] The object of the present invention is therefore to provide a blind detection solution, which alleviates the problems above and thus both produces reliable blind detection decisions and is possible to carry out in real time.

[0008] According to one aspect of the invention the object is achieved by a method of identifying, from a finite set of alternatives (hypotheses), a property of an incoming signal as initially described, which is characterized by deriving quality measures in consideration of interference rejection with respect to unwanted signal components in the incoming signal.

[0009] According to a preferred embodiment of the proposed method the incoming signal is received in one reception branch and the interference rejection is accomplished by means of calculating the quality measures in consideration of a temporal whitening of the incoming signal.

[0010] According to another preferred embodiment of the proposed method separate versions of the incoming signal are received via at least two different reception branches and the interference rejection is accomplished by means of calculating the quality measures in consideration of a spatio decorrelation of the separate versions of the incoming signal.

[0011] According to yet another preferred embodiment of the proposed method separate versions of the incoming signal are received via at least two different reception branches and the interference rejection is accomplished by means of calculating the quality measures in a combined consideration of a spatio decorrelation of the separate versions of the incoming signal and a temporal whitening of the incoming signal. Thus, a so-called spatio-temporal interference rejection is performed.

[0012] According to a further aspect of the invention the object is achieved by a computer program directly loadable into the internal memory of a computer, comprising software for performing the above proposed method when said program is run on a computer.

[0013] According to another aspect of the invention the object is achieved by a computer readable medium, having a program recorded thereon, where the program is to make a computer perform the proposed method.

[0014] According to still another aspect of the invention the object is achieved by a blind signal detector as initially described, which is characterized in that each quality measure generator includes an interference suppressor, which suppresses the effects of unwanted signal components in the incoming signal.

[0015] The invention might place a computation demand on the receiver, which is moderately higher than according to some of the previously known solutions for blind detection without interference rejection. In return, the invention offers a solution that is clearly superior to any of the known blind detection methods in non-ideal signal environments. Naturally, this provides a competitive edge in most communication systems. Furthermore, the invention may be applied in a wide variety of communication systems, irrespective of which type of signal format and transmission medium that is employed.

BRIEF DESCRIPTION OF THE DRAWINGS

[0016] The present invention is now to be explained more closely by means of preferred embodiments, which are disclosed as examples, and with reference to the attached drawings.

[0017]FIG. 1 shows a block diagram over a blind signal detector according to the invention,

[0018]FIG. 2 shows a block diagram over a recursive unit, which is included in a quality measure comparator according to one embodiment of the invention, and

[0019]FIG. 3 illustrates, by means of a flow diagram, a general method according to the invention.

DESCRIPTION OF PREFERRED EMBODIMENTS OF THE INVENTION

[0020] The principle for blind detection according to the invention is applicable in communication systems using many transmission media other than radio. However, free space environments, where the signals typically are transmitted by means of radio waves, generally impose more complex signal conditions than the alternative environments, where the signals are more constrained by, for instance, being conducted via electrical cables or optical fibers. Therefore, a system model including a time dispersive radio channel is introduced here in order to present a general framework for the invention.

[0021] A vector of M received signals, which are symbol space sampled, can be modeled as: $\begin{matrix} {{r(n)} = \begin{bmatrix} \begin{matrix} {r_{1}(n)} \\ {r_{2}(n)} \end{matrix} \\ \quad \\ {r_{M}(n)} \end{bmatrix}} \\ {= {{\sum\limits_{m = 0}^{L}{\begin{bmatrix} \begin{matrix} {h_{1}(m)} \\ {h_{2}(m)} \end{matrix} \\ \quad \\ {h_{M}(m)} \end{bmatrix}{s\left( {n - m} \right)}}} + \begin{bmatrix} \begin{matrix} {v_{1}(n)} \\ {v_{2}(n)} \end{matrix} \\ \quad \\ {v_{M}(n)} \end{bmatrix}}} \\ {= {{\sum\limits_{m = 0}^{L}{{h(m)}{s\left( {n - m} \right)}}} + {v(n)}}} \end{matrix}$

[0022] where h(m) is a vector with a set of coefficients for a tap m in a channel having L+1 taps, s(n) represents the symbols that have been sent, and v(n) denotes additive noise, i.e. an unwanted signal component. The above model is defined for a multi-branch system. Nevertheless, it is applicable also to a single-branch system simply by setting M=1.

[0023] The additive noise v(n) can in turn be modeled by means of an auto regressive model: ${v(n)} = {{\sum\limits_{k = 1}^{K}{{A(k)}{v\left( {n - k} \right)}}} + {e(n)}}$

[0024] where A_(k) is a matrix of auto regressive (AR) coefficients and e(n) is a noise vector, which is assumed to be temporally white and Gaussian with a zero mean and covariance matrix Q:

E{e(n)e(n)^(H) }=Q

[0025] where ^(H) denotes a transpose and complex conjugate (Hermite).

[0026] The covariance matrix of the noise Q has a size of M×M elements and can, in turn, be expressed as:

Q=C _(rr) −C _(rs) C _(ss) ⁻¹ C _(rs) ^(H)

[0027] where $C_{rr} = {\sum\limits_{n = L}^{N_{tr}}{{r\left( {n_{0} + n} \right)}{r^{H}\left( {n_{0} + n} \right)}}}$ $C_{rs} = {\sum\limits_{n = L}^{N_{tr}}{{r\left( {n_{0} + n} \right)}{S^{H}\left( {n_{0} + n} \right)}}}$ $C_{ss} = {\sum\limits_{n = L}^{N_{tr}}{{S(n)}{S^{H}(n)}}}$

[0028] and S(n)=[s(n) s(n−1) . . . s(n−L)]^(T)

[0029] In the above expressions, n₀ denotes a synchronization position and s(n) represents a sequence of N_(tr)+1 training symbols. It should be noted that the matrices above C_(rr) and C_(ss) are referred to as covariance matrices, even though they are not normalized with respect to the number of samples. The covariance matrix of the desired signal C is expressed as:

C=C _(rs) C _(ss) ⁻¹ C _(rs) ^(H)

[0030] i.e. the last term in the expression for the covariance matrix of the noise Q.

[0031] In the single reception branch case (i.e. M=1), the synchronization position n₀ is selected such that the residual noise variance σ²=Q is minimal. When instead, separate versions of the incoming signal are available via multiple reception branches (i.e. M>1), either trace synchronization min{Trace{Q}} or determinant based synchronization min{|Q|} can be used for localizing the synchronization position n₀.

[0032] A least square channel estimate follows from the expression:

[ĥ(0)ĥ(1) . . . ĥ(L)]=C _(rs) C _(ss) ⁻¹

[0033] and the residual noise can be calculated as: ${e(n)} = {{{r\left( {n_{0} + n} \right)} - {\sum\limits_{m = 0}^{L}{{\hat{h}(m)}{s\left( {n - m} \right)}\quad L}}} \leq n \leq {N_{tr}.}}$

[0034] A temporal whitening of the noise in the incoming signals can be accomplished according to a FIR (Finite Impulse Response) filtering: ${r_{w}(n)} = {\sum\limits_{k = 0}^{K}{{W(k)}{r\left( {n - k} \right)}}}$

[0035] where the W(k) matrices represent the FIR coefficients, which are given by: ${W(k)} = \left\{ \begin{matrix} {{- {\hat{A}(k)}},} & {{{for}\quad k} > 0} \\ {I,} & {{{for}\quad k} = 0} \end{matrix} \right.$

[0036] in which I is the identity matrix and the Â_(k) elements are estimated with, for instance, an indirect GLS (Generalized Least Square) multi-branch algorithm or a single-branch LDA (Levinson Durbin Algorithm).

[0037] A whitening filter of FIR type can be constructed by estimating an auto regressive model of the noise, see the matrices W(k) above. This whitening filter reduces the impact from any interference in the equalizer, which in turn improves the equalizer's performance significantly. Especially the adjacent channel interference can thereby be reduced. For instance, the estimation of the auto regressive model can be performed by an LDA.

[0038] A spatio noise decorrelation can be preformed according to the expression:

r _(wD)(n)=Dr _(w)(n)

[0039] where D is a matrix with the following property: {circumflex over (Q)}⁻¹=D^(H) D

[0040] with {circumflex over (Q)} being an estimate of the noise covariance matrix Q. The matrix D can be calculated by using a Cholesky factorization scheme. It should be pointed out that the whitening and the spatio noise decorrelation can be performed in the same step by multiplying the matrix D with the matrices W(k) before carrying out the above FIR filtering. Further details as how to accomplish a combined spatio decorrelation and temporal interference rejection can be found in the article “MLSE and Spatio-Temporal Interference Rejection Combining with Antenna Arrays”, Proceedings European Signal Processing Conference, pp 1341-1344, September 1998 by D. Asztély et al.

[0041] As mentioned earlier, blind detection is necessary in communication systems in which the transmitter may alter between two or more modulation formats without prior announcement. The GSM/EDGE-standard constitutes one such example, where either a GMSK or a 8PSK modulation scheme is used. A so-called derotation r_(GMSK)(n) of a received signal r(n), after which a quality measure that takes interference suppression into account may be calculated, can for the GMSK hypothesis be expressed as:

r _(GMSK)(n)=e ^(−j) ^(₂) ^(x) ^(n) r(n).

[0042] A corresponding derotation r_(8PSK)(n) for the 8PSK hypothesis can be expressed as:

r _(8PSK)(n)=e ^(−j) ^(₈) ^(3π) ^(n) r(n).

[0043] After derotation, the quality measures q_(GMSK)(n) and q_(8PSK)(n) can be derived according to the same principle for both the GMSK hypothesis and the 8PSK hypothesis.

[0044] The incoming signal may either be a scalar (i.e. received in a single branch) or be multi-dimensional (i.e. received via two or more branches).

[0045] An identifying procedure for finding a most probable modulation scheme involves comparing the quality measures q_(GMSK)(n) and q_(8PSK)(n) with each other in order to determine which quality measure that best fulfils a blind selection criterion. For example, if the quality measures q_(GMSK)(n); q_(8PSK)(n) represent a respective signal-to-noise ratio (SNR) after whitening, the test would simply be to find the largest quality measure value (i.e. best SNR). A corresponding modulation scheme would then be regarded as the most probable for the incoming signal. Based on this information, a processing unit (e.g. an equalizer) that operates according to a matching demodulation scheme may then be selected for further processing the incoming signal.

[0046] Either the same equalizer could be used in both the GMSK- and the 8PSK-case, however with different parameter settings, or different equalizer structures could be used for the different demodulation schemes, i.e. one equalizer designed for GMSK and another designed for 8PSK.

[0047] Another example of a situation in which blind detection is necessary, is when different training sequences are employed by the transmitter without prior indication to the receiver. In certain radio communication systems the training sequence is namely not only used for estimating radio channel properties in the receiver, the type of training sequence per se also carries information. For example, a GSM/EDGE system, uses the access burst to transport data in the random access channel (RACH) and the packet random access channel (PRACH). Three different training sequences, TS0, TS1 and TS2, are used by a mobile station to indicate its uplink capability. A base station receiving an uplink signal from the mobile station thus cannot know in advance which of the three possible training sequences that will be sent. Therefore, the receiver in the base station must perform a blind detection in respect of the training sequence. The quality measures to be compared are here denoted q_(TS0), q_(TS1) and q_(TS2), one for each training sequence TS0, TS1 and TS2 respectively. Depending on the quality measure q_(TS0), q_(TS1) or q_(TS2) for the incoming signal that best satisfies a blind selection criterion, a decision is subsequently made whether the training sequence was TS0, TS1 or TS2.

[0048] It should be noted that a particular quality measure in turn may be constituted by any linear or non-linear combination of sub-values. According to the invention, the quality measures nevertheless always take interference suppression into account. Furthermore, the proposed method is applicable to any symbol sequence, i.e. not exclusively to a distinction between different training sequences.

[0049]FIG. 1 shows a block diagram over a general blind signal detector according to the invention, which may be used for blind detection of the above mentioned modulation formats, the training sequences as well as any other unknown property of an incoming signal, provided there is a finite number of alternatives for the unknown property. Particularly, the modulation formats may include any M-ary phase shift keying scheme with M≠8, such as 2PSK, 4PSK or 16PSK (i.e. for M equal 2, 4 and 16 respectively).

[0050] An incoming signal r(n) is fed in parallel to at least two different quality measure generators 101, 102 and 103. The FIG. 1 shows three quality measure generators, however any number larger than one is equally well conceivable. In any case, each quality measure generator 101-103 is adapted to produce a quality measure q₁, q₂, . . . , q_(m) in respect of one out of the possible alternatives for the unknown property p₁, p₂, . . . , p_(m). Nevertheless, in practice, two or more quality measure generators may be represented by the same physical unit, the operation of the generator then being determined by different settings of at least one variable parameter. Consequently, if time allows, all the quality measures q₁-q_(m) can, in fact, be produced in series by one and the same quality measure generator. Furthermore, results obtained in a first quality measure generator, e.g. 101, may be re-used in second quality measure generator, e.g. 102 or 103, in order to reduce the number of calculations. Each quality measure generator 101-103 also includes an interference suppressor, which suppresses unwanted signal components in the incoming signal r(n). Hence, the interference suppressor performs an interference rejection for the incoming signal r(n) received in one reception branch in consideration of a temporal whitening, or for separate versions of the incoming signal r(n) received via two or more reception branches, either in consideration of a spatio decorrelation of the separate versions or in combined consideration of temporal whitening and spatio decorrelation.

[0051] According to one embodiment of the invention, the quality measures q₁-q_(m) are determined on basis of a power level of the incoming signal r(n) after interference rejection with respect to a particular detection hypothesis and a noise power level after interference rejection. As an example, the power levels may be used to express an SNR, which will be expounded below.

[0052] For reception of the incoming signal in a single branch, the following quality measure may be used: $q_{X} = \frac{c_{X}}{{\overset{\sim}{\sigma}}_{X}^{2}}$

[0053] where {tilde over (σ)}_(X) ² denotes the variance of the residual noise after whitening, c_(X) denotes the variance of the desired signal and the subscript X refers to a particular property hypothesis (or quality measure) for the incoming signal r(n). Thus, the blind detection involves whitening both with respect to the desired signal and the residual noise.

[0054] According to an alternative embodiment of the invention, the residual noise after whitening instead forms a basis for the blind detection by means of the following quality measure:

q _(X)=−{tilde over (σ)}_(X) ²

[0055] where a minimum value of {tilde over (σ)}_(X) ² corresponds to a maximum value of the SNR.

[0056] The variance of the residual noise {tilde over (σ)}² is obtained immediately from the LDA, provided that an AR(2)-model is used. Thus, neither all the AR coefficients need to be calculated nor is it necessary to explicitly filter the residual noise. In fact, it is sufficient to merely calculate the quality measure in consideration of a temporal whitening of the incoming signal as follows:

{tilde over (σ)}² =cov(0)

a=−cov(1)/{tilde over (σ)}²

{tilde over (σ)}²(1−|a| ²){tilde over (σ)}²

a=−cov(2)+a·cov(1)/{tilde over (σ)}²

{tilde over (σ)}²=(1−|a| ²){tilde over (σ)}²

[0057] The covariance function cov(m) of the residual noise e(n) can, for instance, be estimated as: ${{cov}(m)} = {\sum\limits_{n = L}^{N_{tr} - m}{e*\left( {n + m} \right){e(n)}}}$ ${{{where}\quad {e(n)}} = {{r\left( {n_{0} + n} \right)} - {\sum\limits_{m = 0}^{L}{{\hat{h}(m)}{s\left( {n - m} \right)}}}}},{L \leq n \leq {N_{tr}.}}$

[0058] In order to avoid several divisions in the expressions above, and thereby render the calculations more efficient, the variance of the residual noise {tilde over (σ)}² can instead be expressed as: ${\overset{\sim}{\sigma}}^{2} = {\frac{\left( {\left( {{cov}(0)} \right)^{2} - {{{cov}(1)}}^{2}} \right)^{2} - {{{{{cov}(0)}{{cov}(2)}} - \left( {{cov}(1)} \right)^{2}}}^{2}}{{{cov}(0)}\left( {\left( {{cov}(0)} \right)^{2} - {{{cov}(1)}}^{2}} \right)}.}$

[0059] According to one embodiment of the invention, when the incoming signal is received via multiple branches, the noise in the different branches can be spatio decorrelated by means of r_(wD)(n)=Dr_(w)(n) and {circumflex over (Q)}⁻¹=D^(H)D, as mentioned earlier. This is applied when searching for the quality measure q_(i) that best fulfils the selection criterion. The procedure thus involves selecting a synchronization position for a sequence of symbols in the incoming signal r(n). In order to avoid a factorization, which is relatively complex from a computational point-of-view, the following quality measure is proposed:

q _(x)=Trace{{tilde over (C)}_(rrX) {tilde over (Q)} _(X) ⁻¹}

[0060] where {tilde over (C)}_(rrX) is the covariance matrix of the incoming signal r(n) after temporal whitening and Q_(X) is a covariance matrix of the residual noise after temporal whitening. The subscript X designates the applicable property hypothesis (or quality measure).

[0061] According to an alternative embodiment of the invention, where only spatio decorrelation is performed, the quality measure may be simplified to:

q _(X)=Trace{C_(rr) Q _(X) ⁻¹}

[0062] where C_(rr) is the covariance matrix of the incoming signal r(n). The covariance matrix Q_(X) is calculated according to

Q _(X) =C _(rr) −C _(rs) C _(ss) ⁻¹ C _(rs) ^(H)

[0063] as described earlier.

[0064] After the spatio decorrelation, the SNR may be expressed as: ${SNR} = \frac{{Trace}\left\{ C_{D} \right\}}{{Trace}\left\{ Q_{D} \right\}}$

[0065] where C_(D) is the covariance matrix of the desired signal after spatio decorrelation and Q_(D) denotes the covariance matrix of the noise after decorrelation. Hence, the SNR can be written: ${SNR} = {\frac{{Trace}\left\{ {DCD}^{H} \right\}}{{Trace}\left\{ {DCD}^{H} \right\}} = {\frac{{Trace}\left\{ {{CD}^{H}D} \right\}}{{Trace}\left\{ {{QD}^{H}D} \right\}} = \frac{{Trace}\left\{ {\left( {C_{rr} - Q} \right)Q^{- 1}} \right\}}{{Trace}\left\{ {QQ}^{- 1} \right\}}}}$ ${SNR} = {{\frac{1}{M}{Trace}\left\{ {C_{rr}Q^{- 1}} \right\}} - 1}$

[0066] In analogy with q_(X)=−{tilde over (σ)}_(X) ² above, the quality measure q_(X)=−|Q_(X)| can be used as an alternative.

[0067] According to one embodiment of the invention, where an incoming signal is received via multiple branches, an SNR-based quality measure $q_{X} = \frac{c_{X}}{{\overset{\sim}{\sigma}}_{X}^{2}}$

[0068] can be calculated for each

[0069] different branch individually. These measures q_(X) may then be added to form a combined quality measure, which exclusively takes temporal whitening into account.

[0070] In any case, a quality measure comparator 110 receives the quality measures q₁-q_(m) and compares them with each other in order to determine which quality measure q_(i) that best fulfils a relevant blind selection criterion. Based on the result of this investigation the quality measure comparator 110 identifies a particular property p_(i), which corresponds to the best quality measure q_(i). According to one embodiment of the invention, the quality measure comparator 110 also selects a particular processing unit 121, 122, . . . , 123 for further possible processing of the incoming signal r(n).

[0071] If further processing is to take place, the quality measure comparator 110 selects the processing unit 122, which corresponds to a quality measure q_(i) that best fulfils the blind selection criterion via a control signal c and a multiple switch 125. This processing unit 122 is namely expected to be capable of handling the incoming signal r(n) optimally by means of applying an appropriate processing principle C_(di), such that a desired resulting signal D_(i) is obtained. In radio applications, the processing units 121-123 are typically constituted by equalizers. However, technically, they can be represented by any alternative unit capable of realizing a processing principle, which is adapted to the particular incoming signal r(n).

[0072] Moreover, according to one embodiment of the invention, when decoding the incoming signal r(n), the selected processing unit 122 also re-uses data having been obtained as a result from the processing in the corresponding quality measure generator.

[0073]FIG. 2 shows a block diagram over a recursive unit 200, which is included in the quality measure comparator 110 according to one embodiment of the invention. A processor 202 in the recursive unit 200 receives a preliminary quality measure q_(i)(t) for a current segment of the received signal r(n), where t denotes a time index corresponding to the number of segments previously received. The processor 202 then generates an enhanced quality measure q_(j) ^(e)(t) for the segment on basis of the preliminary quality measure q_(i)(t) and a quality measure q_(i) ^(e)(t−1) for at least one previous segment of the incoming signal r(n), which is stored in a buffer 201. If the current segment is the first segment of the received signal r(n), the enhanced quality measure q_(i) ^(e)(t) will be identical with the preliminary quality measure q_(i)(1). The thus generated enhanced quality measure q_(j) ^(e)(t) is then used as a basis for a current selection decision. The enhanced quality measure q_(i) ^(e)(t) is also fed to the buffer 201 for storage. An enhanced quality measure q_(i) ^(e)(2) for a following segment of the received signal r(n) is generated by the processor 202 on basis of a combination of the previous (enhanced) quality measure q_(i) ^(e)(1) and a preliminary quality measure q_(i)(2) for this segment r(n), and so on.

[0074] According to a preferred alternative under this embodiment of the invention, the enhanced quality measure q_(i) ^(e)(t) represents an arithmetic average value between the at least one stored quality measure q_(i) ^(e)(t−1) and the preliminary quality measure q_(i)(t). This averaging increases the reliability of the blind detection and is preferably carried out with respect to all bursts in a particular radio block. Optionally, the buffer 201 may be cleared between the separate radio blocks by means of a reset signal z.

[0075] For example, the recursive unit 200 may be utilized to improve the quality of selection decisions in GSM/EDGE between the modulation schemes GMSK and 8PSK. In GSM/EDGE a radio block typically consists of four individual bursts. The modulation (GMSK or 8PSK) is one and the same for all bursts of such a block. In order to take into account the quality measures of all bursts in a particular block when identifying the relevant modulation scheme, the arithmetic average of the respective quality measures for the bursts in the block can, for instance, together form a total quality measure. Unfortunately, in a real-time application, this is not always feasible. It is namely common that a further signal treatment (equalisation, decoding etc) of a first received burst of a block must commence before the later bursts have been received. The decision for the first burst must then rely solely on the quality measure of this burst. However, for the second burst, the quality measures of both the first and the second burst can be used. For the third burst, all of the preceding bursts may again be used, and so on. In other words, the buffer 201 must at least store quality measures from preceding bursts belonging to the same block. These quality measures may either be stored separately or as one or more accumulated variables.

[0076] It should also be noted that, in principle, any computational algorithm with the quality measures of the current and the preceding bursts may be used to reach the decision as to which modulation scheme is being applied. The arithmetic average value thus merely constitutes an example.

[0077] According to another preferred alternative under this embodiment of the invention, a blind detection decision from any intermediate burst is utilized for equalizing the remaining bursts, for instance, in a particular radio block. This procedure is advantageous when no or only very few errors can be tolerated in the detected sequence.

[0078] In order to sum up, a general method of performing blind detection according to the invention will now be described with reference to a flow diagram in FIG. 3.

[0079] A first step 301 receives a segment of an incoming signal, which is presumed to have a property that is unknown with respect to one out of a finite set of alternatives. Subsequently, a step 302 derives a quality measure for the incoming signal in respect of each of the alternatives. The calculation of the quality measures is carried out in consideration of an interference rejection with respect to any unwanted signal components in the incoming signal. A following step 303 identifies a property that represents a best quality measure with respect to a selection criterion. After that, the procedure loops back to the step 301 again.

[0080] The identification in the step 303 may, for instance, involve a sub-step in which the quality measures are ranked from a best score down to a worst score. A following sub-step then selects the property being associated with the topmost quality measure.

[0081] Naturally, all of the process steps, as well as any sub-sequence of steps, described with reference to the FIG. 3 above may be carried out by means of a computer program being directly loadable into the internal memory of a computer, which includes appropriate software for performing the necessary steps when the program is run on a computer. The computer program can likewise be recorded onto arbitrary kind of computer readable medium.

[0082] The term “comprises/comprising” when used in this specification is taken to specify the presence of stated features, integers, steps or components. However, the term does not preclude the presence or addition of one or more additional features, integers, steps or components or groups thereof.

[0083] The invention is not restricted to the described embodiments in the figures, but may be varied freely within the scope of the claims. 

1. A method of identifying, from a finite set of alternatives ({p₁, p₂, . . . , p_(m)}), a property of a particular incoming signal (r(n)), involving deriving from the incoming signal (r(n)), for each of the alternatives, a respective quality measure (q₁, q₂, . . . , q_(m)) representing a particular property of the incoming signal (r(n)), and identifying a property (p_(i)) of the incoming signal (r(n)), which corresponds to a quality measure (q_(i)) that best fulfils a blind selection criterion, characterized by deriving the quality measures (q₁, q₂, . . . , q_(m)) in consideration of interference rejection with respect to unwanted signal components in the incoming signal (r(n)).
 2. A method according to claim 1, characterized by receiving the incoming signal (r(n)) in one reception branch, and calculating the quality measures (q₁, q₂, . . . , q_(m)) in consideration of a temporal whitening of the incoming signal (r(n)).
 3. A method according to claim 2, characterized by calculating the quality measures (q₁, q₂, . . . , q_(m)) on basis of a fictitious temporally whitened version of the incoming signal (r(n)).
 4. A method according to any of the claims 2 or 3, characterized by the quality measure (q₁, q₂, . . . , q_(m)) being inversely proportional to the variance of a residual noise component in a signal resulting from the temporal whitening.
 5. A method according to any of the preceding claims, characterized by receiving separate versions of the incoming signal (r(n)) via at least two different reception branches, and calculating the quality measures (q₁, q₂, . . . , q_(m)) in consideration of a spatio decorrelation of the separate versions of the incoming signal (r(n)).
 6. A method according to any of the preceding claims, characterized by calculating the quality measures (q₁, q₂, . . . , q_(m)) on basis of a fictitious spatially decorrelated version of the incoming signal (r(n)).
 7. A method according to any one of the claims 5 or 6 when dependent on any one of the claims 2-4, characterized by calculating the quality measures (q₁, q₂, . . . , q_(m)) in a combined consideration of the temporal whitening of the incoming signal (r(n)) and the spatio decorrelation of the separate versions of the incoming signal (r(n)) received via the at least two different reception branches.
 8. A method according to any one of the claims 6 or 7, characterized by the deriving of the quality measures (q₁, q₂, . . . , q_(m)) involving selecting a synchronization position for a sequence of symbols in the incoming signal (r(n)) by means of trace synchronization.
 9. A method according to any one of the claims 6 or 7, characterized by the deriving of the quality measures (q₁, q₂, . . . , q_(m)) involving selecting a synchronization position for a sequence of symbols in the incoming signal (r(n)) by means of determinant synchronization.
 10. A method according to any one of the preceding claims, characterized by storing at least one quality measure (q_(i) ^(e)(t−1)) for at least one previous segment of the incoming signal (r(n)), and generating an enhanced quality measure (q_(i) ^(e)(t)) for a current segment of the received signal (r(n)) on basis of the at least one stored quality measure (q_(i) ^(e)(t−1)) and a preliminary quality measure (q_(i)(t)) for the current segment of the incoming signal (r(n)).
 11. A method according to claim 10, characterized by the enhanced quality measure (q_(i) ^(e)(t)) representing an arithmetic average value between the at least one stored quality measure (q_(i) ^(e)(t−1)) and the preliminary quality measure (q_(i)(t)).
 12. A method according to any one of the preceding claims, characterized by the finite set of alternatives ({p₁, p₂, . . . , p_(m)}) including at least two different demodulation schemes.
 13. A method according to claim 12, characterized by the finite set of alternatives ({p₁, p₂, . . . , p_(m)}) including at least one of a Gaussian Minimum Shift Keying scheme and an M-ary Phase Shift Keying scheme.
 14. A method according to any one of the claims 1-13, characterized by the finite set of alternatives ({p₁, p₂, . . . , p_(m)}) including at least two different symbol sequences.
 15. A method according to claim 14, characterized by each of the symbol sequences representing a particular training sequence.
 16. A method according to any one of the preceding claims, characterized by each quality measure (q₁, q₂, . . . , q_(m)) being determined on basis of a power level of the incoming signal (r(n)) after interference rejection and a noise power level after interference rejection.
 17. A method according to any one of the preceding claims, characterized by each quality measure (q₁, q₂, . . . , q_(m)) being represented by a signal-to-noise ratio.
 18. A method according to any one of the preceding claims, characterized by the incoming signal (r(n)) being a radio signal.
 19. A computer program directly loadable into the internal memory of a computer, comprising software for performing the steps of any of the claims 1-18 when said program is run on the computer.
 20. A computer readable medium, having a program recorded thereon, where the program is to make a computer perform the steps of any of the claims 1-18.
 21. A blind signal detector for receiving an incoming signal (r(n)) and automatically identifying a property incoming signal (r(n)) from a finite set of alternatives ({p₁, p₂, . . . , p_(m)}), comprising: at least two quality measure generators (101-103), each receiving the incoming signal (r(n)), and in response thereto, producing a respective quality measure (q₁, q₂, . . . , q_(m)) representing a particular property in the finite set of alternatives ({p₁, p₂, . . . , p_(m)}), and a quality measure comparator (110) receiving the quality measures (q₁, q₂, . . . , q_(m)), comparing the quality measures (q₁, q₂, . . . , q_(m)) with each other and identifying a property (p_(i)) of the incoming signal (r(n)), which corresponds to the quality measure (q_(i)) that best fulfils a blind selection criterion, characterized in that each quality measure generator (101-103) includes an interference suppressor which suppresses the effects of unwanted signal components in the incoming signal (r(n)).
 22. A blind signal detector according to claim 21, characterized in that the incoming signal (r(n)) is fed to the at least two quality measure generators (101-103) via one reception branch, and the at least two quality measure generators (101-103) are adapted to calculate the quality measures (q₁, q₂, . . . , q_(m)) in consideration of a temporal whitening of the incoming signal (r(n)).
 23. A blind signal detector according to claim 21, characterized in that the incoming signal (r(n)) is fed to the at least two quality measure generators (101-103) via at least two different reception branches, and the at least two quality measure generators (101-103) are adapted to calculate the quality measures (q₁, q₂, . . . , q_(m)) in consideration of a spatio decorrelation of the separate versions of the incoming signal (r(n)).
 24. A blind signal detector according to claim 23, characterized in that the at least two quality measure generators (101-103) are adapted to calculate the quality measures (q₁, q₂, . . . , q_(m)) in a combined consideration of the temporal whitening of the incoming signal (r(n)) and the spatio decorrelation of the separate versions of the incoming signal (r(n)) received via the at least two different reception branches.
 25. A blind signal detector according to any one of the claims 21-24, characterized in that at least two the of at least two quality measure generators (101-103) are co-located in a single unit, and the operation of the respective quality measure generator (101-103) is determined by a value of at least one variable parameter.
 26. A blind signal detector according to any one of the claims 21-25, characterized in that at least one first quality measure generator (101) delivers a calculation result to at least one second quality measure generator (102; 103).
 27. A blind signal detector according to any one of the claims 21-26, characterized in that the quality measure comparator (110) includes a recursive unit (200) for storing at least one quality measure (q_(i) ^(e)(t−1)) for at least one previous segment of the incoming signal (r(n)) and generating an enhanced quality measure (q_(i) ^(e)(t)) for a current segment of the received signal (r(n)) on basis of the at least one stored quality measure (q_(i) ^(e)(t−1)) and a preliminary quality measure (q_(i)(t)) for the current segment of the received signal (r(n)). 